Auction Algorithms for Shortest Hyperpath Problems Auction Algorithms for Shortest Hyperpath Problems
نویسندگان
چکیده
The auction{reduction algorithm is a strongly polynomial version of the auction method for the shortest path problem. In this paper we extend the auction{reduction algorithm to diierent types of shortest hyperpath problems in directed hypergraphs. The results of preliminary computational experiences show that the auction{reduction method is comparable to other known methods for speciic classes of hypergraphs.
منابع مشابه
Finding the K shortest hyperpaths: algorithms and applications
The K shortest paths problem has been extensively studied for many years. Efficient methods have been devised, and many practical applications are known. Shortest hyperpath models have been proposed for several problems in different areas, for example in relation with routing in dynamic networks. However, the K shortest hyperpaths problem has not yet been investigated. In this paper we present ...
متن کاملFinding the K shortest hyperpaths
The K shortest paths problem has been extensively studied for many years. Efficient methods have been devised, and many practical applications are known. Shortest hyperpath models have been proposed for several problems in different areas, for example in relation with routing in dynamic networks. However, the K shortest hyperpaths problem has not yet been investigated. In this paper we present ...
متن کاملFinding the K shortest hyperpaths using reoptimization
The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen, Nielsen and Pretolani. In this paper we improve the worst-case computational complexity of an algorithm for finding the K shortest hyperpaths in an ...
متن کاملHyperpath or Shortest Path: An Evaluation Method and a Case Study with GPS Probe Data
Because of travel time uncertainty in traffic networks, the shortest path determined with a priori information may consist of links for which there are long delays and the path may not be optimal. Adaptive routing would suggest more reliable guidance by providing alternative links for en-route switching in the case of traffic congestion and a risk-averse hyperpath particularly provides an alter...
متن کاملA generic auction algorithm for the minimum cost network flow problem
In this paper we broadly generalize the assignment auction algorithm to solve linear minimum cost network flow problems. We introduce a generic algorithm, which contains as special cases a number of known algorithms, including the e-relaxation method, and the auction algorithm for assignment and for transportation problems. The generic algorithm can serve as a broadly useful framework for the d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998